Unification and extension of intersection algorithms in numerical algebraic geometry

The solution set of a system of polynomial equations, called an algebraic set, can be decomposed into finitely many irreducible components. In numerical algebraic geometry, irreducible algebraic sets are represented by witness sets, whereas general algebraic sets allow a numerical irreducible decomposition comprising a collection of witness sets, one for each irreducible component. We denote the solution set of any system of polynomials f : C Ñ C as Vpfq € C . Given a witness set for some algebraic set Z € C and a system of polynomials f : C Ñ C, the algorithms of this article compute a numerical irreducible decomposition of the set Z X Vpfq. While extending the types of intersection problems that can be solved via numerical algebraic geometry, this approach is also a unification of two existing algorithms: the diagonal intersection algorithm and the homotopy membership test. The new approach includes as a special case the “extension problem” where one wishes to intersect irreducible component A of Vpgpxqq with Vpfpx, yqq, where f introduces new variables, y. For example, this problem arises in computing the singularities of A when the singularity conditions are expressed in terms of new variables associated to the tangent space of A. Several examples are included to demonstrate the effectiveness of our approach applied in a variety of scenarios.